Solving open travelling salesman subset-tour problem through a hybrid genetic algorithm
نویسندگان
چکیده
منابع مشابه
Solving Travelling Salesman Problem with an Improved Hybrid Genetic Algorithm
We present an improved hybrid genetic algorithm to solve the two-dimensional Euclidean traveling salesman problem (TSP), in which the crossover operator is enhanced with a local search. The proposed algorithm is expected to obtain higher quality solutions within a reasonable computational time for TSP by perfectly integrating GA and the local search. The elitist choice strategy, the local searc...
متن کاملThe Ordered Clustered Travelling Salesman Problem: A Hybrid Genetic Algorithm
The ordered clustered travelling salesman problem is a variation of the usual travelling salesman problem in which a set of vertices (except the starting vertex) of the network is divided into some prespecified clusters. The objective is to find the least cost Hamiltonian tour in which vertices of any cluster are visited contiguously and the clusters are visited in the prespecified order. The p...
متن کاملSolving Travelling Salesman Problem using Clustering Genetic Algorithm
Solving NP hard problem like Travelling Salesman Problem (TSP) is a major challenge faced by analysts even though many techniques are available. Many versions of Genetic Algorithms are introduced by researchers to improve its performance in solving TSP. Clustering Genetic Algorithm (CGA) was recently introduced and this paper analyzes the results obtained by implementing it for TSP. It is obser...
متن کاملA New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters
In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...
متن کاملParallel Hybrid Genetic Algorithm for Solving Traveling Salesman Problem
This paper deals with the basics of genetic algorithm, a universal method of optimization and the need for parallel genetic algorithm. This also discusses briefly on the traveling salesman problem. A methodology is proposed to solve this problem using the different
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Project Management
سال: 2021
ISSN: 2371-8366,2371-8374
DOI: 10.5267/j.jpm.2021.5.002